Static Type Checking of Model Transformation Programs
نویسنده
چکیده
Model transformation is seen as a promising approach to automate software development and verification, thus improving quality and reducing production costs significantly. However, errors of transformation programs can propagate into the generated artifacts complicating the detection of errors. The current paper proposes a static type checking approach for early detection of typing errors of partially typed transformation programs. The approach describes type safety as constraint satisfaction problems, and uses a dedicated back-annotation mechanism for error feedback.
منابع مشابه
Static Type Checking of Model Transformations by Constraint Satisfaction Programming
The control structure of the Viatra2 transformation programs is untyped making it easier to misuse the type system. The aim of this paper is to provide a static type checker tool to these transformation programs that can detect those errors. We use a generic static analysis framework for analysis, and as an underlying engine constraint satisfaction problem solver is used. For this reason it is ...
متن کاملKa I Pun , Martin Steffen , and Volker Stolz I SBN 82 - 7368 - 385 - 0 I SSN 0806 - 3036 November 2012
Deadlocks are a common problem in programs with lock-based concurrency and are hard to avoid or even to detect. One way for deadlock prevention is to statically analyse the program code to spot sources of potential deadlocks. We reduce the problem of deadlock checking to race checking, another prominent concurrency-related error for which good (static) checking tools exist. The transformation u...
متن کاملModel Checking of Control-Finite CSP Programs
We investigate an automatic verification mechanism for control-finite CSP programs using the model checking technique. CSP programs with variables and usual sequential constructs are transformed into transition systems to apply the model checking technique. More specifically, binding of variables are attached to states and sequential statements are treated uniformly as events in a parallel envi...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملThe Verification Grand Challenge and Abstract Interpretation
Interpretation is a theory of approximation of mathematical structures, in particular those involved in the semantic models of computer systems [4,10,11]. Abstract interpretation can be applied to the systematic construction of methods and effective algorithms to approximate undecidable or very complex problems in computer science. The scope of application is rather large e.g. from type inferen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010